tail recursion การใช้

• Without this, tail recursions can eventually lead to stack overflow.
• Scheme language standard requires implementations to recognize and optimize tail recursion.
• Programmers in the Scheme dialect often express loops using tail recursion.
• But it does have tail recursion modulo cons.
• Tail recursion is a special case of recursion which can be easily transformed to iteration.
• MiniD is closures, and tail recursion.
• The downwards funarg problem complicates the efficient compilation of tail recursion and code written in continuation-passing style.
• Therefore, in languages that recognize this property of tail calls, tail recursion saves both space and time.
• Tail recursion optimization can be implemented by transforming the program into continuation passing style during compiling, among other approaches.
• Implementing tail call elimination only for tail recursion, rather than for all tail calls, is something significantly easier.
• As noted above, Scheme tends to favor the functional style, using tail recursion and continuations to express control flow.
• It has to be noted that the same optimization could have been obtained by using a tail recursion for this example.
• As a result, functional languages such as Scala that target the JVM can efficiently implement direct tail recursion, but not mutual tail recursion.
• As a result, functional languages such as Scala that target the JVM can efficiently implement direct tail recursion, but not mutual tail recursion.
• The above program is not written in a tail recursion style, because the multiplication function ( " * " ) is in the tail position.
• Additionally, no tail recursion ever occurs on a child node, so the tail recursion loop can only move from a child back to its successive ancestors.
• Additionally, no tail recursion ever occurs on a child node, so the tail recursion loop can only move from a child back to its successive ancestors.
• Combined with tail recursion, such folds approach the efficiency of loops, ensuring constant space operation, when lazy evaluation of the final result is impossible or undesirable.
• This tail recursion can be efficiently compiled as a loop, but can't deal with infinite lists at all  it will recurse forever in an infinite loop.
• It is also an in-place algorithm, requiring only constant memory overhead if tail-call optimization is available, or if eliminating the tail recursion with a loop: